Some results on geometric independency trees
نویسندگان
چکیده
A plane spanning tree is a tree drawn in the plane so that its edges are closed straight line segments and any two edges do not intersect internally, and no three of its vertices are collinear. In this paper, we present several results on a plane spanning tree such that the graph which is obtained from the tree by adding a line segment between any two end-vertices of the tree is self-intersecting.
منابع مشابه
Detection of some Tree Species from Terrestrial Laser Scanner Point Cloud Data Using Support-vector Machine and Nearest Neighborhood Algorithms
acquisition field reference data using conventional methods due to limited and time-consuming data from a single tree in recent years, to generate reference data for forest studies using terrestrial laser scanner data, aerial laser scanner data, radar and Optics has become commonplace, and complete, accurate 3D data from a single tree or reference trees can be recorded. The detection and identi...
متن کاملThe second geometric-arithmetic index for trees and unicyclic graphs
Let $G$ be a finite and simple graph with edge set $E(G)$. The second geometric-arithmetic index is defined as $GA_2(G)=sum_{uvin E(G)}frac{2sqrt{n_un_v}}{n_u+n_v}$, where $n_u$ denotes the number of vertices in $G$ lying closer to $u$ than to $v$. In this paper we find a sharp upper bound for $GA_2(T)$, where $T$ is tree, in terms of the order and maximum degree o...
متن کاملInvestigation on the Amount of Mortality of Iranian Oak Trees (Quercus brantii Lindi) using Satellite Imagery (Case study: Dashtebarm forests of Fars Province)
In recent years, oak trees in the Zagros forests have suffered a lot of fatalities for unclear reasons. Determining the rate and severity of forest crown density changes is important for the investigation and management of these forests. This research was carried out with the aim of determining the amount of crown cover changes in the forest area of Dashtebarm in Fars province under the influen...
متن کاملSpanning trees with pairwise nonadjacent endvertices
A spanning tree of a connected graph G is said to be an independency tree if all its endvertices are pairwise nonadjacent in G. We prove that a connected graph G has no independency tree if and only if G is a cycle, a complete graph or a complete bipartite graph the color classes of which have equal cardinality.
متن کاملA Simple Parallel Algorithm for Constructing Independent Spanning Trees on Twisted Cubes∗
In 1989, Zehavi and Itai [46] proposed the following conjecture: a k-connected graph G must possess k independent spanning trees (ISTs for short) with an arbitrary node as the common root. An n-dimensional twisted cube, denoted by TQn, is a variation of hypercubes with connectivity n to achieving some improvements of structure properties. Recently, Yang [42] proposed an algorithm for constructi...
متن کامل